Inference and Modeling with Log-concave Distributions
نویسندگان
چکیده
منابع مشابه
Inference and Modeling with Log-concave Distributions
Log-concave distributions are an attractive choice for modeling and inference, for several reasons: The class of log-concave distributions contains most of the commonly used parametric distributions and thus is a rich and flexible nonparametric class of distributions. Further, the MLE exists and can be computed with readily available algorithms. Thus, no tuning parameter, such as a bandwidth, i...
متن کاملClustering with mixtures of log-concave distributions
The EM algorithm is a popular tool for clustering observations via a parametric mixture model. Two disadvantages of this approach are that its success depends on the appropriateness of the assumed parametric model, and that each model requires a different implementation of the EM algorithm based on model-specific theoretical derivations. We show how this algorithm can be extended to work with t...
متن کاملLearning Multivariate Log-concave Distributions
We study the problem of estimating multivariate log-concave probability density functions. We prove the first sample complexity upper bound for learning log-concave densities on Rd, for all d ≥ 1. Prior to our work, no upper bound on the sample complexity of this learning problem was known for the case of d > 3. In more detail, we give an estimator that, for any d ≥ 1 and ǫ > 0, draws Õd ( (1/ǫ...
متن کاملApproximation by Log - Concave Distributions with Applications to Regression
We study the approximation of arbitrary distributions P on ddimensional space by distributions with log-concave density. Approximation means minimizing a Kullback–Leibler type functional. We show that such an approximation exists if, and only if, P has finite first moments and is not supported by some hyperplane. Furthermore we show that this approximation depends continuously on P with respect...
متن کاملEfficient Robust Proper Learning of Log-concave Distributions
We study the robust proper learning of univariate log-concave distributions (over continuous and discrete domains). Given a set of samples drawn from an unknown target distribution, we want to compute a log-concave hypothesis distribution that is as close as possible to the target, in total variation distance. In this work, we give the first computationally efficient algorithm for this learning...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistical Science
سال: 2009
ISSN: 0883-4237
DOI: 10.1214/09-sts303